Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs

We consider the reduction of a symmetric indefinite matrix pair (A,B), with B nonsingular, to tridiagonal-diagonal form by congruence transformations. This is an important reduction in solving polynomial eigenvalue problems with symmetric coefficient matrices and in frequency response computations. The pair is first reduced to symmetric-diagonal form. We describe three methods for reducing the ...

متن کامل

Symmetric Eigenvalue Problem: Tridiagonal Reduction

Our ultimate goal in this project is to solve the symmetric eigenvalue problem on symmetric multiprocessor machines more quickly than existing implementations. In order to achieve this goal, we have chosen to implement an improved multithreaded version of a specific phase of the current best algorithmic approach, namely the reduction of a full symmetric matrix to banded form using two-sided ort...

متن کامل

Positive Definiteness via Off-Diagonal Scaling of a Symmetric Indefinite Matrix.

Indefinite symmetric matrices that are estimates of positive definite population matrices occur in a variety of contexts such as correlation matrices computed from pairwise present missing data and multinormal based theory for discretized variables. This note describes a methodology for scaling selected off-diagonal rows and columns of such a matrix to achieve positive definiteness. As a contra...

متن کامل

Towards a classification of the tridiagonal pairs

Let K denote a field and let V denote a vector space over K with finite positive dimension. Let End(V ) denote the K-algebra consisting of all K-linear transformations from V to V . We consider a pair A,A ∈ End(V ) that satisfy (i)–(iv) below: (i) Each of A,A is diagonalizable. (ii) There exists an ordering {Vi} d i=0 of the eigenspaces of A such that A Vi ⊆ Vi−1+ Vi + Vi+1 for 0 ≤ i ≤ d, where...

متن کامل

Diagonal Operators and Bernstein Pairs

Replacing the nested sequence of ""nite" dimensional subspaces by the nested sequence of "closed" subspaces in the classical Bernstein lethargy theorem, we obtain a version of this theorem for the space B(X; Y) of all bounded linear maps. Using this result and some properties of diagonal operators, we investigate conditions under which a suitable pair of Banach spaces form an exact Bernstein pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2004

ISSN: 0895-4798,1095-7162

DOI: 10.1137/s0895479802414783